On colored designs-III: on λ-colored H-designs, H having λ edges
نویسندگان
چکیده
منابع مشابه
On colored designs-III: on lambda-colored H-designs, H having lambda edges
Let H be a graph having edges which has no loops and multiple edges. Complete results about the existence of colored designs CH |CK n with exactly colors, are established for 6 4 and for arbitrary when H is a matching or a star. In all cases when there is a design it can be chosen to be cyclic. Slightly less complete results are obtained when H is a path or a cycle. c © 2002 Elsevier Science B....
متن کاملA Colored Version of the λ-Calculus
Rippling is a technique developed for inductive theorem proving which uses syntactic differences of terms to guide the proof search. Annotations (like colors) to terms are used to maintain this information. This technique has several advantages, e.g. it is highly goal oriented and involves little search. In this paper we give a general formalisation of coloring terms in a higher-order setting. ...
متن کامل(3, Λ)-group Divisible Covering Designs
Let U, g, k and A be positive integers with u :::: k. A (k, A)-grOUp divisible covering design ((k, A)-GDCD) with type gU is a A-cover of pairs by k-tuples of a gu-set X with u holes of size g, which are disjoint and spanning. The covering number, C(k, A; gil), is the minimum number of blocks in a (k, A)-GDCD of type gUo In this paper, the detennination ofllie fimction C(3, A; gil) begun by [6]...
متن کاملThe existence of ( v , 6 , λ ) - perfect Mendelsohn designs with λ > 1
The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λv(v− 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far ...
متن کاملResolving P(v, 3, λ) designs into regular P3-configurations
There is one nontrivial regular configuration on two paths of three vertices, and one on three paths. Path designs which are resolvable into copies of these configurations are shown to exist whenever basic numerical conditions are met, with a few possible exceptions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00181-9